Solving Infinite-Domain CSPs Using the Patchwork Property

The constraint satisfaction problem (CSP) has important applications in computer science and AI. In particular, infinite-domain CSPs have been intensively used subareas of AI such as spatio-temporal reasoning. Since is a computationally hard problem, much work devoted to identifying restricted problems that are efficiently solvable. One way doing this restrict the interactions variables constraints, highly successful approach bound treewidth underlying primal graph. Bodirsky & Dalmau [J. Comput. System. Sci., 79(1), 2013] Huang et al. [Artif. Intell., 195, proved CSP(?) can be solved n^(f(w)) time (where n size instance, w graph f computable function) for certain classes languages ?. We improve f(w)n^(O(1)), where function only depends on language ?, whose basic relations patchwork property. Hence, fixed-parameter tractable our algorithm asymptotically faster than previous ones. Additionally, not binary so it applicable strictly larger class However, there exist natural covered by Dalmau's but ours.